Sandwich Theorem of Cover Times

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The asymmetric sandwich theorem

We discuss the asymmetric sandwich theorem, a generalization of the Hahn–Banach theorem. As applications, we derive various results on the existence of linear functionals that include bivariate, trivariate and quadrivariate generalizations of the Fenchel duality theorem. Most of the results are about affine functions defined on convex subsets of vector spaces, rather than linear functions defin...

متن کامل

The Sandwich Theorem

This report contains expository notes about a function ti(G) that is popularly known as the Lovasz number of a graph G. There are many ways to define G(G), and the surprising variety of different characterizations indicates in itself that ti(G) should be interesting. But the most interesting property of 8(G) is probably the fact that it can be computed efficiently, although it lies “sandwiched”...

متن کامل

sandwich classification theorem

the present note arises from the author's talk at the conference ``ischia group theory 2014''. for subgroups $fle n$ of a group $g$ denote by $lat(f,n)$ the set of all subgroups of $n$, containing $f$. let $d$ be a subgroup of $g$. in this note we study the lattice $ll=lat(d,g)$ and the lattice $ll'$ of subgroups of $g$, normalized by $d$. we say that $ll$ satisfies sandwich classification theo...

متن کامل

Chapter 6 Cover Times

The maximal mean hitting time max i;j E i T j arises in many contexts. In Chapter 5 we saw how to compute this in various simple examples, and the discussion of in Chapter 4 indicated general methods (in particular, the electrical resistance story) for upper bounding this quantity. But what we've done so far doesn't answer questions like \how large can be, for random walk on a n-vertex graph". ...

متن کامل

Exponential concentration of cover times

We prove an exponential concentration bound for cover times of general graphs in terms of the Gaussian free field, extending the work of Ding, Lee, and Peres [8] and Ding [7]. The estimate is asymptotically sharp as the ratio of hitting time to cover time goes to zero. The bounds are obtained by showing a stochastic domination in the generalized second Ray-Knight theorem, which was shown to imp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ISRN Probability and Statistics

سال: 2013

ISSN: 2090-472X

DOI: 10.1155/2013/839846